The Constraint Satisfaction Problem and Universal Algebra
نویسنده
چکیده
This paper gives a brief survey of current research on the complexity of the constraint satisfaction problem over fixed constraint languages. §
منابع مشابه
Polymorphisms, and How to Use Them
This article describes the algebraic approach to Constraint Satisfaction Problem that led to many developments in both CSP and universal algebra. No prior knowledge of universal algebra is assumed. 1998 ACM Subject Classification F.2.0 [Analysis of Algorithms and Problem Complexity] General, F.2.0 [Discrete Mathematics] General
متن کاملAbsorption in Universal Algebra and CSP
The algebraic approach to Constraint Satisfaction Problem led to many developments in both CSP and universal algebra. The notion of absorption was successfully applied on both sides of the connection. This article introduces the concept of absorption, illustrates its use in a number of basic proofs and provides an overview of the most important results obtained by using it. 1998 ACM Subject Cla...
متن کاملClassifying the Complexity of Constraints Using Finite Algebras
Many natural combinatorial problems can be expressed as constraint satisfaction problems. This class of problems is known to be NP-complete in general, but certain restrictions on the form of the constraints can ensure tractability. Here we show that any set of relations used to specify the allowed forms of constraints can be associated with a finite universal algebra and we explore how the com...
متن کاملThe Complexity of Constraint Satisfaction Problems∗
The tractability conjecture for constraint satisfaction problems (CSPs) describes the constraint languages over a finite domain whose CSP can be solved in polynomial-time. The precise formulation of the conjecture uses basic notions from universal algebra. In this talk, we give a short introduction to the universal-algebraic approach to the study of the complexity of CSPs. Finally, we discuss a...
متن کاملConstraints, Graphs, Algebra, Logic, and Complexity
A large class of problems in AI and other areas of computer science can be viewed as constraintsatisfaction problems. This includes problems in database query optimization, machine vision, belief maintenance, scheduling, temporal reasoning, type reconstruction, graph theory, and satisfiability. All of these problems can be recast as questions regarding the existence of homomorphisms between two...
متن کامل